A New Formalization of Probabilistic GLR Parsing
نویسندگان
چکیده
This paper presents a new formalization of probabilistic GLR language modeling for statistical parsing. Our model inherits its essential features from Briscoe and Carroll's generalized probabilistic LR model [3], which obtains context-sensitivity by assigning a probability to each LR parsing action according to its left and right context. Briscoe and Carroll's model, however, has a drawback in that it is not formalized in any probabilistically well-founded way, which may degrade its parsing performance. Our formulation overcomes this drawback with a few signi cant re nements, while maintaining all the advantages of Briscoe and Carroll's modeling.
منابع مشابه
Empirical Evaluation of Probabilistic GLR Parsing
This paper presents the results of experiments on probabilistic GLR (PGLR), a new probabilistic model proposed by (Inui et al., 1997). The model is formalized based on stack transition during parsing distinguishing it from the existing models proposed byWright andWrigley, and Briscoe and Carroll. Our model produces a remarkable improvement in syntactic parsing with probability. Associating prob...
متن کاملA structured statistical language model conditioned by arbitrarily abstracted grammatical categories based on GLR parsing
This paper presents a new statistical language model for speech recognition, based on Generalized LR parsing. The proposed model, the Abstracted Probabilistic GLR (APGLR) model, is an extension of the existing structured language model known as the Probabilistic GLR (PGLR) model. It can predict next words from arbitrarily abstracted categories. The APGLR model is also a generalization of the or...
متن کاملGLR Parser with Conditional Action Model(CAM)
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one action using the control rules learned without any LR parsing resource. It shows good performance in speed. But it has a disadvantage that it cannot correct the previous mistakes, thus directly affects the parsing result. The second one is the probabilistic LR parsing app...
متن کاملEmpirical Support for Probabilistic GLR Parsing
This paper discusses the e ectiveness of a new probabilistic generalized LR model (PGLR) in word-based parsing (morphological and syntactic analysis) tasks, in which we have to consider the word segmentation and multiple part-of-speech problems. Parsing a sentence from the morphological level makes the task much more complex because of the increase of parse ambiguity stemming from word segmenta...
متن کاملString Shuffling over a Gap between Parsing and Plan Recognition
We propose a new probabilistic plan recognition algorithm YR based on an extension of Tomita’s Generalized LR (GLR) parser for grammars enriched with the shuffle operator. YR significantly outperforms previous approaches based on topdown parsers, shows more consistent run times among similar libraries, and degrades more gracefully as plan library complexity increases. YR also lifts the restrict...
متن کامل